Fairness in Context-Free Grammars under Every Choice-strategy
نویسندگان
چکیده
In (Porat et al., 1982, Inform. and Control 55, 108-116) the notion of fair derivations in context-free grammars was introduced and studied. The main result there is a characterization of fairly terminating grammars as non-uaria6le-doubling. In this paper we show that the same characterization is valid under canonical deriuations in which the next variable to be expanded is deterministically chosen, leaving nondeterminism only to the decision as to which rule (of the chosen variable) to apply. Two families of canonical derivations are introduced and studied as special cases: spinal derivations and lqvered derivations. @? 1989 Academic Press. Inc.
منابع مشابه
The Equivalence of Context Limited Grammars to Context Free Grammars SCIENTIFIC REPORT
A grammar G is context limited If there exists a partial ordering on the alphabet of G under which, far every production » -♦ 8 of G, every letter of a Is smaller than some letter of 6. It Is proved that the languages generated by context limited grammar«? are .lust the context free languages. Unamblgulty of general grammars Is defined and discussed carefully, preparatory to proving that the la...
متن کاملMultiple Context-Free Tree Grammars: Lexicalization and Characterization
Multiple (simple) context-free tree grammars are investigated, where “simple” means “linear and nondeleting”. Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one (generating the same tree language) in which each rule of the grammar contains a lexical symbol. Due to this transformation, the rank of the nonterm...
متن کاملFuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars
Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy context-free grammars. These fuzzy context-free K-grammars provide a general framework to describe correctly as well as erroneously derived sentences by a single generating mechanism. They model the situation of making a finite choice out of an infinity of possible grammatical errors during each co...
متن کاملWell-Founded Semantics for Boolean Grammars
Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In this paper we give a novel semantics for boolean grammars which applies to all such grammars, independently of their syntax. The key idea of our proposal comes from the area of negation in logic programming, and in particular f...
متن کاملA Fuzzy Approach to Erroneous Inputs in Context-Free Language Recognition
− Using fuzzy context-free grammars one can easily describe a finite number of ways to derive incorrect strings together with their degree of correctness. However, in general there is an infinite number of ways to perform a certain task wrongly. In this paper we introduce a generalization of fuzzy context-free grammars, the so-called fuzzy context-free K-grammars, to model the situation of maki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 80 شماره
صفحات -
تاریخ انتشار 1989